Moment Preserving Constrained Resampling with Applications to Particle-in-Cell Methods
نویسندگان
چکیده
In simulations of partial differential equations using particle-in-cell (PIC) methods, it is often advantageous to resample the particle distribution function to increase simulation accuracy, reduce compute cost, and/or avoid numerical instabilities. We introduce an algorithm for particle resampling called Moment Preserving Contrained Resampling (MPCR). The general algorithm partitions the system space into smaller subsets and is designed to conserve any number of particle and grid quantities with a high degree of accuracy (i.e. machine accuracy). The resampling scheme can be integrated into any PIC code. The advantages of MPCR, including performance, accuracy, and stability, are presented by examining several numerical tests, including a use-case study in gyrokinetic fusion plasma simulations. The tests demonstrate that while the computational cost of MPCR is negligible compared to the nascent particle evolution in PIC methods, periodic particle resampling yields a significant improvement in the accuracy and stability of the results.
منابع مشابه
An Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm
In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملA Rate and History-Preserving Resampling Algorithm for Neural Spike Trains
Resampling methods are popular tools for exploring the statistical structure of neural spike trains. In many applications, it is desirable to have resamples that preserve certain non-Poisson properties, like refractory periods and bursting, and that are also robust to trial-to-trial variability. Pattern jitter is a resampling technique that accomplishes this by preserving the recent spiking his...
متن کاملA Constrained Resampling Strategy for Mesh Improvement
In many geometry processing applications, it is required to improve an initial mesh in terms of multiple quality objectives. Despite the availability of several mesh generation algorithms with provable guarantees, such generated meshes may only satisfy a subset of the objectives. The conflicting nature of such objectives makes it challenging to establish similar guarantees for each combination,...
متن کامل